Style-Agnostic Reinforcement Learning
نویسندگان
چکیده
AbstractWe present a novel method of learning style-agnostic representation using both style transfer and adversarial in the reinforcement framework. The style, here, refers to task-irrelevant details such as color background images, where generalizing learned policy across environments with different styles is still challenge. Focusing on representations, our trains actor diverse image generated from an inherent perturbation generator, which plays min-max game between without demanding expert knowledge for data augmentation or additional class labels training. We verify that achieves competitive better performances than state-of-the-art approaches Procgen Distracting Control Suite benchmarks, further investigate features extracted model, showing model captures invariants less distracted by shifted style. code available at https://github.com/POSTECH-CVLab/style-agnostic-RL.KeywordsReinforcement learningDomain generalizationNeural transferAdversarial
منابع مشابه
Agnostic KWIK learning and efficient approximate reinforcement learning
A popular approach in reinforcement learning is to use a model-based algorithm, i.e., an algorithm that utilizes a model learner to learn an approximate model to the environment. It has been shown that such a model-based learner is efficient if the model learner is efficient in the so-called “knows what it knows” (KWIK) framework. A major limitation of the standard KWIK framework is that, by it...
متن کاملAgent-Agnostic Human-in-the-Loop Reinforcement Learning
Providing Reinforcement Learning agents with expert advice can dramatically improve various aspects of learning. To this end, prior work has developed teaching protocols that enable agents to learn efficiently in complex environments. In many of these methods, the teacher’s guidance is tailored to agents with a particular representation or underlying learning scheme, offering effective but high...
متن کاملAgnostic System Identification for Model-Based Reinforcement Learning
A fundamental problem in control is to learn a model of a system from observations that is useful for controller synthesis. To provide good performance guarantees, existing methods must assume that the real system is in the class of models considered during learning. We present an iterative method with strong guarantees even in the agnostic case where the system is not in the class. In particul...
متن کاملAgnostic Online Learning
We study learnability of hypotheses classes in agnostic online prediction models. The analogous question in the PAC learning model [Valiant, 1984] was addressed by Haussler [1992] and others, who showed that the VC dimension characterization of the sample complexity of learnability extends to the agnostic (or ”unrealizable”) setting. In his influential work, Littlestone [1988] described a combi...
متن کاملToward Eecient Agnostic Learning
In this paper we initiate an investigation of generalizations of the Probably Approximately Correct (PAC) learning model that attempt to signiicantly weaken the target function assumptions. The ultimate goal in this direction is informally termed agnostic learning, in which we make virtually no assumptions on the target function. The name derives from the fact that as designers of learning algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-19842-7_35